منابع مشابه
On 3-connected hamiltonian line graphs
Thomassen conjectured that every 4-connected line graph is hamiltonian. It has been proved that every 4-connected line graph of a claw-free graph, or an almost claw-free graph, or a quasi-claw-free graph, is hamiltonian. In 1998, Ainouche et al. [2] introduced the class of DCT graphs, which properly contains both the almost claw-free graphs and the quasi-claw-free graphs. Recently, Broersma and...
متن کاملHamiltonian connectedness in 3-connected line graphs
We investigate graphs G such that the line graph L(G) is hamiltonian connected if and only if L(G) is 3-connected, and prove that if each 3-edge-cut contains an edge lying in a short cycle of G, then L(G) has the above mentioned property. Our result extends Kriesell’s recent result in [J. of Combinatorial Theory, Ser. B. 82 (2001), 306-315] that every 4-connected line graph of a claw free graph...
متن کاملHamiltonian Connected Line Graphs
Thomassen conjectured [8] that every 4-connected line graph is hamiltonian. An hourglass is a graph isomorphic to K5−E(C), where C is a cycle of length 4 in K5. In [2], it is shown that every 4-connected line graph without an induced subgraph isomorphic to the hourglass is hamiltonian connected. In this note, we prove that every 3-connected, essentially 4-connected hourglass-free line graph is ...
متن کاملOn s-hamiltonian-connected line graphs
1 A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton 2 path (a path including every vertex of G); and G is s-hamiltonian-connected if the deletion 3 of any vertex subset with at most s vertices results in a hamiltonian-connected graph. In this 4 paper, we prove that the line graph of a (t+4)-edge-connected graph is (t+2)-hamiltonian5 connected if and only ...
متن کاملHamiltonian connected hourglass free line graphs
Thomassen conjectured [8] that every 4-connected line graph is hamiltonian. An hourglass is a graph isomorphic to K5−E(C4), where C4 is a cycle of length 4 in K5. In [2], it is shown that every 4-connected line graph without an induced subgraph isomorphic to the hourglass is hamiltonian connected. In this note, we prove that every 3-connected, essentially 4-connected hourglass free line graph i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.02.024